Primitive 2-factorizations of the complete graph
نویسنده
چکیده
LetF be a 2-factorization of the complete graphKv admitting an automorphism groupG acting primitively on the set of vertices. IfF consists of Hamiltonian cycles, thenF is the unique, up to isomorphisms, 2-factorization ofKpn admitting an automorphism group which acts 2-transitively on the vertex-set, see [A. Bonisoli, M. Buratti, G. Mazzuoccolo, Doubly transitive 2-factorizations, J. Combin.Designs 15 (2007) 120–132.]. In the non-Hamiltonian casewe construct an infinite family of exampleswhose automorphism group does not contain a subgroup acting 2-transitively on vertices. © 2007 Elsevier B.V. All rights reserved. MSC: 05C70; 05C15; 05C25
منابع مشابه
On the Enumeration of One-Factorizations of Complete Graphs Containing Prescribed Automorphism Groups
In this paper we use orderly algorithms to enumerate (perfect) one-factorizations of complete graphs, the automorphism groups of which contain certain prescribed subgroups. We showed that, for the complete graph Ki2, excluding those one-factorizations containing exactly one automorphism of six disjoint cycles of length two, there are precisely 56391 nonisomorphic one-factorizations of Ki2 with ...
متن کاملPancomponented 2-factorizations of complete graphs
We pose and solve the existence of 2-factorizations of complete graphs and complete bipartite graphs that have the number of cycles per 2-factor varying, called pancomponented. Such 2-factorizations exist for all such graphs. The pancomponented problem requires a slight generalization of the methods used to solve pancyclic 2-factorization problem, by building 2-factors from cyclically generated...
متن کاملSequentially Perfect and Uniform One-Factorizations of the Complete Graph
In this paper, we consider a weakening of the definitions of uniform and perfect one-factorizations of the complete graph. Basically, we want to order the 2n − 1 one-factors of a one-factorization of the complete graph K2n in such a way that the union of any two (cyclically) consecutive one-factors is always isomorphic to the same two-regular graph. This property is termed sequentially uniform;...
متن کاملVarious One-Factorizations of Complete Graphs
Methods to compute 1–factorizations of a complete graphs of even order are presented. For complete graphs where the number of vertices is a power of 2, we propose several new methods to construct 1–factorizations. Our methods are different from methods that make use of algebraic concepts such as Steiner triple systems, starters and all other existing methods. We also show that certain complete ...
متن کاملSelf-invariant 1-Factorizations of Complete Graphs and Finite Bol Loops of Exponent 2∗
Let Ω be a complete graph on an even number n = 2m of vertices V = V(Ω) = {ω1, . . . , ωn} and assume that K = {k1, . . . , kn−1} is a 1-factorization of Ω. Identify every k ∈ K with the fixed point free involution of Sym(V) which interchanges the ends of every edge in k and set GK = 〈K〉. Then K is said to be self-invariant if Kk = K for all k ∈ K. Heiss [Hei] studied self-invariant 1-factoriza...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 308 شماره
صفحات -
تاریخ انتشار 2008